Random-Turn Hex and Other Selection Games

نویسندگان

  • Yuval Peres
  • Oded Schramm
  • Scott Sheffield
  • David Bruce Wilson
چکیده

Overview. The game of Hex , invented independently by Piet Hein in 1942 and John Nash in 1948 [9], has two players who take turns placing stones of their respective colors on the hexagons of a rhombus-shaped hexagonal grid (see Figure 1). A player wins by completing a path connecting the two opposite sides of his or her color. Although it is easy to show that player I has a winning strategy, it is far from obvious what that strategy is. Hex is usually played on an 11× 11 board (e.g., the commercial version by Parker Brothers® and the Computer Olympiad Hex Tournament both use 11× 11 boards), for which the optimal strategy is not yet known. (For a book on practical Hex strategy see [3], and for further information on Hex see [23], [7], [1], or [6].)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random-Turn Hex and Other Selection Games

In this report, we summarize the results in [6]. We define a mathematical formulation for all selection games. When considering the random-turn selection game, we prove that the result of the game equals to two players play randomly. By using the theory of Boolean functions, we show that the average number of turns before determining the winner of Random-Turn Hex is at least L3/2+o(1), where L ...

متن کامل

Artificial Intelligence for Bidding Hex

We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman’s work connecting random-turn games to bidding games.

متن کامل

Artificial intelligence for Bidding Hex

We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman’s work connecting random-turn games to bidding games.

متن کامل

Havannah and TwixT are PSPACE-complete

Numerous popular abstract strategy games ranging from hex and havannah to lines of action belong to the class of connection games. Still, very few complexity results on such games have been obtained since hex was proved pspace-complete in the early eighties. We study the complexity of two connection games among the most widely played. Namely, we prove that havannah and twixt are pspacecomplete....

متن کامل

Bias in Monte Carlo Simulations Due To Pseudo-Random Number Generator Initial Seed Selection

Pseudo-random number generators can bias Monte Carlo simulations of the standard normal probability distribution function with initial seeds selection. Five generator designs were initial-seeded with values from 10000 HEX to 1FFFF HEX , estimates of the mean were calculated for each seed, the distribution of mean estimates was determined for each generator and simulation histories were graphed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 114  شماره 

صفحات  -

تاریخ انتشار 2007